An L<SUP>p</SUP>-Inequality With Application to Ergodic Theory
نویسنده
چکیده
In the last few years a large number of papers have appeared in the literature dealing with the weak convergence of iterates of contractions and strong convergence of their averages. The trend started with the Blum-Hanson Theorem [3]. The latest result in this direction is due to Akcoglu and Sucheston [ 1 ], [2]. The purpose of this paper is to give a simple, straightforward proof of the Adcoglu-Sucheston theorem; the present proof avoids approximation by finite-dimensional operators for which the contraction case is reduced to the invertible isometry case, and thus avoids altogether the application of Akcoglu's "Dilation Theorem". Let (X,F_,#) be a measure space and for 1 < p < o% let LP = LP(X,F,#) denote the usual Banach space. We write LP+= { fG LPIf•>0} . The following inequality was suggested to us by [ 1 ] (where a particular case of this inequality appears): The LP-Inequality. Let 1 < p < oo. Let f • L• g • LP+. Then for any 0 < e < 1 1 we have, with o• = (p 1) + p-l: (1) ffp-1 g d#•ellfll•+e IIgll• +e•-f f. gp-1 d#. PROOF: We may assume without loss of generality that g > O. Let 0 < •/< K
منابع مشابه
The Wills Functional and Gaussian Processes
The Wills functional from the theory of lattice point enumeration can be adapted to produce the following exponential inequality for zero mean Gaussian processes: Ee sup t (X t ?(1=2) 2 t) e E sup t X t : An application is a new proof of the deviation inequality for the supremum of a Gaussian process above its mean: P (sup t X t ? E sup t X t a) e ?(1=2)a 2 == 2 ; where a > 0 and 2 = sup t 2 t .
متن کاملWeak-L1 estimates and ergodic theorems
We prove that for any dynamical system (X,Σ,m, T ), the maximal operator defined by N∗f(x) = sup n 1 n # { 1 ≤ i : f(T ix) i ≥ 1 n } is almost everywhere finite for f in the Orlicz class L log logL(X), extending a result of Assani [2]. As an application, a weighted return times theorem is also proved.
متن کاملSolution of the 9th Homework
Proof. Let us first assume that c > 0. To prove that sup(cA) = c(sup A), we claim that sup(cA) ≤ c(sup A) and sup(cA) ≥ c(sup A). For the first inequality, let a′ ∈ cA be arbitrary. Then a′ = ca for some a ∈ A. But since a ≤ sup A, we have a′ = ca ≤ c(sup A). This shows that c(sup A) is an upper bound of cA, hence we have sup(cA) ≤ c(sup A). The reverse inequality also follows in a similar mann...
متن کاملOn the Application of the Borel-cantelli Lemma
The celebrated Borel-Cantelli lemma asserts that (A) If ~P(E,,) < 00, then P (lim sup Ek) =O; (B) If the events Es are independent and if xP(Ek) = m, then P(lim sup Eh) = 1. In intuitive language P(lim. sup &) is the probability that the events Eh occur “infinitely often” and will be denoted by P(Ek i.0.). This lemma is the basis of all theorems of the strong type in probability theory. Its app...
متن کاملA Markov-type inequality for arbitrary plane continua
Markov’s inequality is sup [−1,1] |f ′| ≤ (deg f) sup [−1,1] |f |, for all polynomials f . We prove a precise version of this inequality with an arbitrary continuum in the complex plane instead of the interval [−1, 1]. Theorem 1. Let E be a continuum in the complex plane, and f a polynomial of degree d. Then capE sup E |f ′| ≤ 21/d−1d2 sup E |f |. (1) Here cap denotes the transfinite diameter (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004